ZPiE: Zero-Knowledge Proofs in Embedded Systems
نویسندگان
چکیده
Zero-Knowledge Proofs (ZKPs) are cryptographic primitives allowing a party to prove another that the former knows some information while keeping it secret. Such premise can lead development of numerous privacy-preserving protocols in different scenarios, like proving knowledge credentials server without leaking identity user. Even when applications ZKPs were endless, they not exploited wild for couple decades due fact computing and verifying proofs was too computationally expensive. However, advent efficient schemes (in particular, zk-SNARKs) made this primitive break into scene fields cryptocurrencies, smart-contracts, more recently, self-sovereign scenarios: private-by-design management authentication. Nevertheless, its adoption environments Internet Things (IoT) remains unexplored computational limitations embedded systems. In paper, we introduce ZPiE, C library intended create ZKP be executed Its main feature is portability: compiled, executed, used out-of-the-box wide variety devices. Moreover, our proof-of-concept has been proved work smoothly devices with limited resources, which execute state-of-the-art authentication protocols.
منابع مشابه
Some Zero-Knowledge Proofs
Consider a general proof system for a language in NP. That is, suppose we have a language L 2 NP and a string x 2 L. For example, let L be GRAPH-ISOMORPHISM and x = (G0; G1) a pair of isomorphic graphs. Suppose Victor is not convinced that x 2 L, so he calls his friend Peggy (who is infinitely powerful) and asks for a proof. Peggy agrees, because she’s nice that way, applies her infinite power,...
متن کاملZero-Knowledge Identity Proofs
The problem of proving identity, according to Bishop in [2], can generally be solved using some of the following things: (1) something you know (like a password), (2) something you have (like an identification badge), (3) something you are (such as a fingerprint), and (4) where you are (such as your computer’s internet address). Many identification schemes focus on the first problem, proving kn...
متن کاملZero Knowledge Proofs
Zero-knowledge proofs are cryptographic protocols that allow a prover to prove that they have some knowledge of a certain kind, without revealing any additional information about that knowledge. For example, I might want to prove that I know a secret preimage w for some hash h = hash(w), without revealing what that secret w is. Digital signatures are a bit like a zero knowledge proof: “I know a...
متن کاملProofs of Zero Knowledge
We present a protocol for verification of “no such entry” replies from databases. We introduce a new cryptographic primitive as the underlying structure, the keyed hash tree, which is an extension of Merkle’s hash tree. We compare our scheme to Buldas et al.’s Undeniable Attesters and Micali et al.’s Zero Knowledge Sets. In the following, the term database refers to a system supplying the simpl...
متن کاملSymbolic Malleable Zero-knowledge Proofs
Zero-knowledge (ZK) proofs have become a central building block for a variety of modern security protocols, e.g., as ZK-SNARKs in Pinocchio (IEEE S&P 2013) and ADSNARK (IEEE S&P 2015). One of the reasons is that modern ZK constructions, such as the Groth-Sahai proof system, offer novel types of cryptographic flexibility: a participant is able to re-randomize existing ZK proofs to achieve, for i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9202569